Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks
نویسندگان
چکیده
We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.
منابع مشابه
Optimal design of cross docking supply chain networks with time-varying uncertain demands
This paper proposes an integrated network design model for a post-distribution cross-docking strategy, comprising multi product production facilities with shared production resources, capacitated cross docks with setup cost and customer zones with time windows constraints. The model is dynamic in terms of time-varying uncertain demands, whereas uncertainty is expressed with scenario approach an...
متن کاملOptimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
متن کاملSurvivable Network Design: Routing of Flows and Slacks
We present a new mixed–integer programming model and a column generation method for the survivable design of telecommunication networks. In contrast to the failure scenario models, the new model has almost the same number of constraints as the regular network design problem, which makes it effective for large instances. Even though the complexity of pricing the exponentially many variables of t...
متن کاملBounds for Energy-Efficient Survivable IP Over WDM Networks With Network Coding
In this work we establish analytic bounds for the energy efficiency of the 1+1 survivable IP over WDM networks using network coding. The analytic bounds are shown to be in close agreement with our previously reported results. They provide verification of the MILP and heuristics proposed previously and an efficient, compact means of evaluating the network results, and allow the performance of la...
متن کاملDesign of Survivable Networks: A survey
For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication netw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 124 شماره
صفحات -
تاریخ انتشار 2003